The Geometry of the Critically Periodic Curves in the Space of Cubic Polynomials
نویسندگان
چکیده
We provide an algorithm for computing the Euler characteristic of the curves Sp in P 3 ' C, consisting of all polynomials with a periodic critical point of period p in the space of critically-marked, complex, cubic polynomials. The curves were introduced in [Mi, BKM], and the algorithm applies the main results of [DP]. The output is shown for periods p ≤ 26.
منابع مشابه
Capturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملMetric and periodic lines in the Poincare ball model of hyperbolic geometry
In this paper, we prove that every metric line in the Poincare ball model of hyperbolic geometry is exactly a classical line of itself. We also proved nonexistence of periodic lines in the Poincare ball model of hyperbolic geometry.
متن کامل3D Reconstruction Using Cubic Bezier Spline Curves and Active Contours (Case Study)
Introduction 3D reconstruction of an object from its 2D cross-sections (slices) has many applications in different fields of sciences such as medical physics and biomedical engineering. In order to perform 3D reconstruction, at first, desired boundaries at each slice are detected and then using a correspondence between points of successive slices surface of desired object is reconstructed. Mate...
متن کاملAn Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves
In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 22 شماره
صفحات -
تاریخ انتشار 2013